Quantum zero-error algorithms cannot be composed

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Zero-Error Algorithms Cannot be Composed

We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In oracle terms, we give a relativized world where ZQP 6= ZQP, while classically we always have ZPP = ZPP.

متن کامل

Bounds for Small-Error and Zero-Error Quantum Algorithms

We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in this space. Using this, we deduce new lower and upper bounds for qu...

متن کامل

Quantum History Cannot Be Copied

We show that unitarity does not allow cloning of any two points in a ray. This has implication for cloning of the geometric phase information in a quantum state. In particular, the quantum history which is encoded in the geometric phase during cyclic evolution of a quantum system cannot be copied. We also prove that the generalized geometric phase information cannot be copied by a unitary opera...

متن کامل

Quantum states cannot be transmitted efficiently classically

We show that any classical communication protocol that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of n qubits (held by another) must transmit at least 2 bits, up to constant factors. The argument is based on a lower bound on the classical communication complexity of a distributed variant of the Fourier sampling problem. We o...

متن کامل

Quantum Measurements Cannot be Proved to be Random

The postulates of quantum mechanics say that when a measurement is made on a quantum state the outcome of the measurement is random [1]. In classical physics, if the state of a closed system is known, then the state of that system is completely predictable. As far as we know, randomness only exists in quantum mechanics [2]. Everett proposed a purely unitary quantum theory [3] (without probabili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2003

ISSN: 0020-0190

DOI: 10.1016/s0020-0190(03)00254-0